Alexander numbering of knotted surface diagrams

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 2 N ov 1 99 8 Alexander Numbering of Knotted Surface Diagrams

A formula that relates triple points, branch points, and their distance from infinity is presented.

متن کامل

Phase diagrams of knotted and unknotted ring polymers.

The phase diagram for a lattice ring polymer under applied force, with variable solvent quality, for different topological knot states, is determined for the first time. In addition to eliminating pseudophases where the polymer is flattened into a single layer, it is found that nontrivial knots result in additional pseudophases under tensile force conditions.

متن کامل

Finite Type Invariants of W-knotted Objects I: W-knots and the Alexander Polynomial

This is the first in a series of papers studying w-knots, and more generally, wknotted objects (w-braids, w-tangles, etc.). These are classes of knotted objects which are wider but weaker than their “usual” counterparts. To get (say) w-knots from usual knots (or u-knots), one has to allow non-planar “virtual” knot diagrams, hence enlarging the the base set of knots. But then one imposes a new r...

متن کامل

Finite Type Invariants of W-knotted Objects: from Alexander to Kashiwara and Vergne

w-Knots, and more generally, w-knotted objects (w-braids, w-tangles, etc.) make a class of knotted objects which is wider but weaker than their “usual” counterparts. To get (say) w-knots from u-knots, one has to allow non-planar “virtual” knot diagrams, hence enlarging the the base set of knots. But then one imposes a new relation, the “overcrossings commute” relation, further beyond the ordina...

متن کامل

Value Numbering

Value numbering is a compiler-based program analysis method that allows redundant computations to be removed. This paper compares hash-based approaches derived from the classic local algorithm1 with partitioning approaches based on the work of Alpern, Wegman, and Zadeck2. Historically, the hash-based algorithm has been applied to single basic blocks or extended basic blocks. We have improved th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2000

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-00-05479-4